Termination Tools in Ordered Completion
نویسندگان
چکیده
Ordered completion is one of the most frequently used calculi in equational theorem proving. The performance of an ordered completion run strongly depends on the reduction order supplied as input. This paper describes how termination tools can replace fixed reduction orders in ordered completion procedures, thus allowing for a novel degree of automation. Our method can be combined with the multi-completion approach proposed by Kondo and Kurihara. We present experimental results obtained with our ordered completion tool omkbTT for both ordered completion and equational theorem proving.
منابع مشابه
Multi-completion with Termination Tools (System Description)
In this paper we describe a new tool for performing KnuthBendix completion with automatic termination tools. It is based on two ingredients: (1) the inference system for completion with multiple reduction orderings introduced by Kurihara and Kondo (1999) and (2) the inference system for completion with external termination provers proposed by Wehrman, Stump and Westbrook (2006) and implemented ...
متن کاملHandling infinitely branching well-structured transition systems
Most decidability results concerning well-structured transition systems apply to the finitely branching variant. Yet some models (inserting automata, ωPetri nets, . . . ) are naturally infinitely branching. Here we develop tools to handle infinitely branching WSTS by exploiting the crucial property that in the (ideal) completion of a well-quasi-ordered set, downward-closed sets are finite union...
متن کاملHandling Infinitely Branching WSTS
Most decidability results concerning well-structured transition systems apply to the finitely branching variant. Yet some models (inserting automata, ω-Petri nets, ...) are naturally infinitely branching. Here we develop tools to handle infinitely branching WSTS by exploiting the crucial property that in the (ideal) completion of a well-quasi-ordered set, downward-closed sets are finite unions ...
متن کاملSlothrop: Knuth-Bendix Completion with a Modern Termination Checker
A Knuth-Bendix completion procedure is parametrized by a reduction ordering used to ensure termination of intermediate and resulting rewriting systems. While in principle any reduction ordering can be used, modern completion tools typically implement only Knuth-Bendix and path orderings. Consequently, the theories for which completion can possibly yield a decision procedure are limited to those...
متن کاملKnuth-Bendix Completion with a Termination Checker
Knuth-Bendix completion takes as input a set of universal equations and attempts to generate a convergent rewriting system with the same equational theory. An essential parameter is a reduction order used at runtime to ensure termination of intermediate rewriting systems. Any reduction order can be used in principle, but modern completion tools typically implement only a few classes of such ord...
متن کامل